搜索资源列表
NQueens
- 这是一个N后问题，首先是用非递归减枝思想实现算法。同时也包括了位图能适应的放大与缩小函数。然后用VC实现界面的显示结果。-This is a N Queens problem， first by using non-recursive algorithm of branch thinking. Then use the VC to display the results.
n_queen
- 自己写的解决n皇后问题的一个c++ 源代码，希望对初学者有所帮助-Write your own solution to an n queens problem c++ source code, want to help beginners
queen
- 本程序应用c++语言，很好地实现了n皇后问题。-The program application c++ language, it is very well n queens problem.
queen
- 实现N皇后的问题，主要是利用回朔算法，觉得挺好，和大家分享-N Queens problem to achieve, mainly using retrospective method, I feel very good, and share
QueenN
- 国际象棋棋盘中的N皇后问题，不少朋友请知道吧？在一个NXN的国际象棋棋盘中摆n个皇后，使这Ｎ个皇后不能互相被对方吃掉，你知道应该怎么做么？怎么个摆法？要想知道答案，就解读一下本代码吧。-Chess board in the N queens problem, many friends you know? In a NXN chess board in the place n queens, so that the N queens can not eat each other by the ot
nn
- N皇后问题的算法，算法设计中的基本算法，-N queens algorithm, algorithm design, the basic algorithm
nqueen
- 用概率算法求解N皇后问题。1、拉斯维加斯概率算法 每一行得到了几个摆放位置时，不是按顺序进行摆放，而是随机摆放的。因此程序每次运行的时间都不一样。用拉斯维加斯算法除非找不到解，如果找到，答案就一定是正确的。-Probabilistic algorithm with N queens problem. 1, Las Vegas probabilistic algorithms have several display each line position, not by placing the
NQUEENS
- N queens problem :Code to adjust n queens in a N*N chess board such that no 2 queens are in the same row,in same Column and in same diagonal
1945_N_Queens_Question
- 在NXN格的国际象棋棋盘上摆放N个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 第一行为一个整数T，表示有T组数据。 以下T行，每行有一个整数n（0<n<=11），如上所述。 对于每组数据输出一行，即问题的答案。 -In NXN chess board grid placing N queens on, it can not attack each other, that any two of the Queen can
n_queens
- Problema de N queens con backtraking
NQueens
- Solves the N-Queens problem using hillclimbing.-Solves the N-Queens problem using hillclimbing.
Queen_lv
- 这个代码是用visual c++6.0编写的用概率算法求n皇后问题，当输入n具体值时便会出现失败和成功探测的步数，以及耗时等信息，很好地实现了经典的n皇后问题，即棋盘上放置皇后要有一定的规则，比如不同行列等。-This code is written in visual c++6.0 using probabilistic algorithms find n queens problem, the exact value of the input n there will be failures
Queen
- 八皇后 进一步加深编程，进一步难度为N皇后问题-Eight Queens program to further deepen and further difficulty for the N queens problem
n_queen
- 这个包裹实现的是分支限界法解决n王后问题，input.txt和output.txt分别掌管输入n和输出一种方案-This package implements a branch and bound method to solve the n queens problem, input.txt and output.txt were in charge of input and output of a program of n
XHstudent
- 1.对多个链表进行操作 2.回溯法求解0/1背包 3.分枝限界法求解0/1背包 4.回溯法求解n—皇后问题 5.图的操作（邻接表表示）-1. Operate on multiple lists 2. Backtracking method for solving 0/1 knapsack 3. Branch and bound method for solving 0/1 knapsack 4. Backtracking to solve n-queens pr
N_queen
- N皇后问题实现 及操作 c++实现其数据结构-N queens problem c++ implementation and operation of the data structure to achieve its
problem-solving
- 各种问题算法，包括，N皇后问题回溯算法，动态计算网络最长最短路线，货郎担界限，矩阵乘法动态规划等-Algorithm for various problems, including, N Queens problem backtracking algorithm, dynamic network of the longest shortest path computation, Traveling Salesman boundaries, such as dynamic programming
NQueenrecursion
- N皇后的递归算法。使用java语言编写。可以在计算机上实现-N Queens of the recursive algorithm. Using java language. Can be implemented on a computer
N_queens
- 求解N皇后问题：把N个皇后放在一个棋盘上，每行和每列只能有一个皇后。另外，一个皇后只能在任一行、列或对角线上。要求皇后数≥100。用了两种方法，回溯法和启发式修补法。-Solve N Queen' s problem: N queens on a chessboard, each row and each column can have only one Queen. Further, only in a queen in any row, column, or diagonal. Que
nhuanghou
- n皇后问题解法，最典型的是8皇后，用于递归回溯法的经典案例。-n queens solution, the most typical is 8 Queen, for a classic example of a recursive backtracking.